home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Magnum One
/
Magnum One (Mid-American Digital) (Disc Manufacturing).iso
/
d22
/
ct20.arc
/
CT20.DOC
next >
Wrap
Text File
|
1991-05-16
|
6KB
|
163 lines
Cache Test v 2.0
by
George Spafford
Summary
This program is designed to help a user evaluate the impacts
of a cache, or the changes to an existing cache, on a drive's
performance.
Furthermore, with users' increasingly using caches during a
variety of tasks, it is important to find the optimal cache
settings given the task at hand. Whereas a word processor
might make heavy usage of sequential files, a database
might make heavy usage of random access files. With this
in mind, the memory requirements, sectors cached, write
delays and so forth have many possible variations.
By default, Cache Test creates a 10,000 record
sequential file and then a 10,000 record random access
file. These temporary files are approximately 1.3 megabytes
in size.
This program uses BIOS to do all of its reads and writes,
so any hardware or software cache should be able to get
some good "hits." In attempt to flush caches during the
test, files are frequently opened and closed.
All of the times that this program writes are the result of
subtracting the beginning time from the ending time. Nothing
fancy, so the values are relatively accurate.
A few definitions:
"ButterFly Test" The middle record is read and then a
record is alternatingly and read in each
direction from the middle. Say you have
a 100 record file, the read order would
be 50,49,51,48,52,47,53 . . . and so
forth.
"Crescendo Read" Records are read alternatingly in from the end of
the file and the beginning file. This is to say,
record 1, 10000, 2, 9999, 3, 9998, 4, 9997 etc.
"Stepping-by-1" A random access file's records are being accessed
one at a time.
"Stepping-by-10" A random access file's records are being accessed
on every 10th record.
"Write-by-10" A random access file's records are being updated
on every 10th record.
"Overall" This is the total time of all tests AND file
deletes. So, it might not reflect the sum
of all tests exactly, but it should be very
close.
I just wanted to make those meanings a little clearer.
******************************************************************
Usage of this program is:
CT </D:d></N:n></S></R></B></1)</2> . . . </9>
CT by itself will clear the screen and then ask you for the
desired drive and then proceed using a 10,000 record
default.
Explanation of switches:
/D:d This specifies "d" as the drive to be tested.
/N:n This specifies the number of test records.
Note, the only limitation here is the available space
on your test drive. 10,000 records takes 1.3M, 20,000
takes 2.6M and so forth. You can also go as small as
you want, but you will reach a point where your test
will lose its validity.
The default value, if this switch is not used, is
10,000 records.
/B Test both sequential and random access records.
/R Test random access records only.
/S Test sequential access records only.
HISTORY:
V2.0 5/16/91
Due to some users have limited drive space, switches
were added to allow for different size tests to
occur. I was somewhat hesitant to do this because it
negated the ability to call results "standard," but
what really is standard?
Switches were also added to allow users to select
what tests they want to run. For now, all that can
be specified is whether or not to run all tests,
sequential tests only, or random tests only.
The ButterFly test was also added in an attemp to
give look-ahead caches a hard time. Some of the
caches that use a FIFO method of purging will have a
heck of a time with this one.
Added timers/cleared up timers for the sequential and
overall tests. Also speaking of timers, to avoid
slowing down some routines, I have removed some of
the video effects that were for the user's benefit
only.
Special thanks to Jonathan Fisk for all of his
suggestions and debugging efforts.
Special thanks also go out to Tim Akright, the sysop
of Queued Access for all of his support.
V1.0 5/10/91
Well, I released it. That pretty well sums it up.
I hope this program helps you evaluate some of your problems
or even makes some solutions/benefits clear. I wrote this
during some of my spare time and if you would like to make a
contribution to offset some of my modem's phone bills, I'd
appreciate it ($5). If you have any suggestions, I'd REALLY like
to hear those too.
Sincerely,
George Spafford
3001 LakeShore Drive, #329
St. Joseph, MI 49085
Data: (616) 468-5026 Queued Access BBS 2400-8-N-1
And now for the unpleasantries:
CT IS DISTRIBUTED AS IS. THE AUTHOR (GEORGE SPAFFORD) MAKES NO
WARRANTY OF ANY KIND, EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
TO WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE,
WITH RESPECT TO THIS SOFTWARE AND DOCUMENTATION. IN NO EVENT SHALL
THE AUTHOR BE LIABLE FOR ANY DAMAGES, INCLUDING LOST PROFITS, LOST
SAVINGS, OR ANY OTHER INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OF OR THE INABILITY TO USE THIS PROGRAM.
----------------------------------------------------------------
Is it just me, or do all of the disclaimers look the same??